The Multiplayer Nonzero-Sum Dynkin Game in Continuous Time
نویسندگان
چکیده
منابع مشابه
The Multi-player Nonzero-sum Dynkin Game in Continuous Time
In this paper we study the N-player nonzero-sumDynkin game (N ≥ 3) in continuous time, which is a non-cooperative game where the strategies are stopping times. We show that the game has a Nash equilibrium point for general payoff processes. AMS Classification subjects: 91A15 ; 91A10 ; 91A30 ; 60G40 ; 91A60.
متن کاملThe Continuous Time Nonzero-Sum Dynkin Game Problem and Application in Game Options
In this paper we study the nonzero-sum Dynkin game in continuous time, which is a two-player noncooperative game on stopping times. We show that it has a Nash equilibrium point for general stochastic processes. As an application, we consider the problem of pricing American game contingent claims by the utility maximization approach.
متن کاملVehicle Routing Problem in Competitive Environment: Two-Person Nonzero Sum Game Approach
Vehicle routing problem is one of the most important issues in transportation. Among VRP problems, the competitive VRP is more important because there is a tough competition between distributors and retailers. In this study we introduced new method for VRP in competitive environment. In these methods Two-Person Nonzero Sum games are defined to choose equilibrium solution. Therefore, revenue giv...
متن کاملDistribution Design of Two Rival Decenteralized Supply Chains: a Two-person Nonzero Sum Game Theory Approach
We consider competition between two decentralized supply chains network under demand uncertainty. Each chain consists of one risk-averse manufacturer and a group of risk-averse retailers. These two chains present substitutable products to the geographical dispensed markets. The markets’ demands are contingent upon prices, service levels, and advertising efforts of two supply chains. We formulat...
متن کاملContinuous-Time Dynkin Games with Mixed Strategies
Let (X,Y, Z) be a triple of payoff processes defining a Dynkin game R̃(σ, τ) = E [ Xσ1{τ>σ} + Yτ1{τ<σ} + Zτ1{τ=σ} ] , where σ and τ are stopping times valued in [0, T ]. In the case Z = Y , it is well known that the condition X ≤ Y is needed in order to establish the existence of value for the game, i.e., infτ supσ R̃(σ, τ) = supσ infτ R̃(σ, τ). In order to remove the condition X ≤ Y , we introduc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Control and Optimization
سال: 2014
ISSN: 0363-0129,1095-7138
DOI: 10.1137/110855132